Parametric shape analysis via 3-valued logic

Parametri Shape Analysis via 3-Valued Logi

Static Program Analysis via 3-Valued Logic

This paper reviews the principles behind the paradigm of “abstract interpretation via -valued logic,” discusses recent work to extend the approach, and summarizes ongoing research aimed at overcoming remaining limitations on the ability to create programanalysis algorithms fully automatically.

Lightweight Specialized 3-Valued Logic Shape Analyzer

We describe the design and implementation of a specialized shape analysis tool based on 3-valued logic. Our analyzer can reason about programs manipulating recursive data structures, such as singlyand doubly-linked lists, yielding precise results that are comparable to those of the wellknown reference implementation, in only a fraction of the time. In particular, (a) we apply a new and effectiv...

Abstraction Refinement for 3-Valued-Logic Analysis

ion Refinement for 3-Valued-Logic Analysis Alexey Loginov, Thomas Reps, and Mooly Sagiv 1 Comp. Sci. Dept., University of Wisconsin; {alexey,reps}@cs.wisc.edu 2 School of Comp. Sci., Tel-Aviv University; [email protected] Abstract. This paper concerns the question of how to create abstractions that are useful for program analysis. It presents a method that refines an abstraction automatical...

Qualitative Spatial Reasoning Via 3-Valued Heterogeneous Logic

Systems for qualitative spatial reasoning (QSR) are usually formulated as relation algebras, and reasoning in such systems is performed by constraint-satisfaction techniques. While this is often adequate, it is a rather inexpressive framework that cannot model and solve many spatial reasoning problems; it can also complicate the combination of different spatial formalisms, e.g., the combination...